Increasing the chromatic number of a random graph
نویسندگان
چکیده
منابع مشابه
Increasing the chromatic number of a random graph
What is the minimum number of edges that have to be added to the random graph G = Gn,0.5 in order to increase its chromatic number χ = χ(G) by one percent ? One possibility is to add all missing edges on a set of 1.01χ vertices, thus creating a clique of chromatic number 1.01χ. This requires, with high probability, the addition of Ω(n/ log n) edges. We show that this is tight up to a constant f...
متن کاملtotal dominator chromatic number of a graph
given a graph $g$, the total dominator coloring problem seeks aproper coloring of $g$ with the additional property that everyvertex in the graph is adjacent to all vertices of a color class. weseek to minimize the number of color classes. we initiate to studythis problem on several classes of graphs, as well as findinggeneral bounds and characterizations. we also compare the totaldominator chro...
متن کاملOn the chromatic number of a random 5-regular graph
It was only recently shown by Shi and Wormald, using the differential equation method to analyse an appropriate algorithm, that a random 5-regular graph asymptotically almost surely has chromatic number at most 4. Here, we show that the chromatic number of a random 5-regular graph is asymptotically almost surely equal to 3, provided a certain four-variable function has a unique maximum at a giv...
متن کاملThe set chromatic number of a graph
For a nontrivial connected graph G, let c : V (G) → N be a vertex coloring of G where adjacent vertices may be colored the same. For a vertex v of G, the neighborhood color set NC(v) is the set of colors of the neighbors of v. The coloring c is called a set coloring if NC(u) 6= NC(v) for every pair u, v of adjacent vertices of G. The minimum number of colors required of such a coloring is calle...
متن کاملThe Chromatic Number of a Signed Graph
In 1982, Zaslavsky introduced the concept of a proper vertex colouring of a signed graph G as a mapping φ : V (G) → Z such that for any two adjacent vertices u and v the colour φ(u) is different from the colour σ(uv)φ(v), where is σ(uv) is the sign of the edge uv. The substantial part of Zaslavsky’s research concentrated on polynomial invariants related to signed graph colourings rather than on...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorics
سال: 2010
ISSN: 2156-3527,2150-959X
DOI: 10.4310/joc.2010.v1.n4.a1